$\mathbb{Z}_{q}(\mathbb{Z}_{q}+u\mathbb{Z}_{q})-$ linear skew constacyclic codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Skew constacyclic codes over Galois rings

We generalize the construction of linear codes via skew polynomial rings by using Galois rings instead of finite fields as coefficients. The resulting non commutative rings are no longer left and right Euclidean. Codes that are principal ideals in quotient rings of skew polynomial rings by a two sided ideals are studied. As an application, skew constacyclic self-dual codes over GR(4) are constr...

متن کامل

Skew constacyclic codes over finite chain rings

Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right divisors of x − λ, where λ is a unit element, are exhibited. When λ = 1, the generators of Euclidean and Hermitian dual codes of such codes are determined tog...

متن کامل

A circulant approach to skew-constacyclic codes

We introduce circulant matrices that capture the structure of a skew-polynomial ring F[x; θ] modulo the left ideal generated by a polynomial of the type x − a. This allows us to develop an approach to skew-constacyclic codes based on such circulants. Properties of these circulants are derived, and in particular it is shown that the transpose of a certain circulant is a circulant again. This rec...

متن کامل

New linear codes from constacyclic codes

One of the main challenges of coding theory is to construct linear codes with the best possible parameters. Various algebraic and combinatorial methods along with computer searches are used to construct codes with better parameters. Given the computational complexity of determining the minimum distance of a code, exhaustive searches are not feasible for all but small parameter sets. Therefore, ...

متن کامل

$\mathbb{Z}_{q}(\mathbb{Z}_{q}+u\mathbb{Z}_{q})$-Linear Skew Constacyclic Codes

In this paper, we study skew constacyclic codes over the ring ZqR where R = Zq + uZq, q = p s for a prime p and u2 = 0. We give the definition of these codes as subsets of the ring ZqR . Some structural properties of the skew polynomial ring R[x, θ] are discussed, where θ is an automorphism of R. We describe the generator polynomials of skew constacyclic codes over R and ZqR. Using Gray images ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra Combinatorics Discrete Structures and Applications

سال: 2020

ISSN: 2148-838X

DOI: 10.13069/jacodesmath.671815